翻訳と辞書 |
List of combinatorial computational geometry topics : ウィキペディア英語版 | List of combinatorial computational geometry topics List of combinatorial computational geometry topics enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character. See List of numerical computational geometry topics for another flavor of computational geometry that deals with geometric objects as continuous entities and applies methods and algorithms of nature characteristic to numerical analysis. ==Construction/representation==
* Boolean operations on polygons * Convex hull * Hyperplane arrangement * Polygon decomposition * * Polygon triangulation * * * Minimal convex decomposition * * * Minimal convex cover problem (NP-hard) * * * Minimal rectangular decomposition * * Tessellation problems * Shape dissection problems * Straight skeleton * Stabbing line problem *Triangulation * * Delaunay triangulation * *Point set triangulation * * Polygon triangulation * Voronoi diagram
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「List of combinatorial computational geometry topics」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|